Single machine scheduling with a generalized job-dependent cumulative effect

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single Machine Scheduling with Job-Dependent Machine Deterioration

We consider the single machine scheduling problem with job-dependent machine deterioration. In the problem, we are given a single machine with an initial non-negative maintenance level, and a set of jobs each with a non-preemptive processing time and a machine deterioration. Such a machine deterioration quantifies the decrement in the machine maintenance level after processing the job. To avoid...

متن کامل

Scheduling with job dependent machine speed

The power consumption rate of computing devices has seen an enormous increase over the last decades. Therefore computer systems must make a trade-off between performance and energy usage. This observation has led to speed scaling, a technique that adapts the speed of the system to balance energy and performance. Fundamentally, when implementing speed scaling, an algorithm must make two decision...

متن کامل

Single machine scheduling with interfering job sets

We consider two single machine bicriteria scheduling problems in which jobs belong to either of two different disjoint sets, each set having its own performance measure. The problem has been referred to as interfering job sets in the scheduling literature and also been called multi-agent scheduling where each agent’s objective function is to be minimized. In the first problem (P1) we look at mi...

متن کامل

A note on single-machine scheduling with job-dependent learning effects

Article history: Received 11 November 2009 Accepted 15 June 2010 Available online 22 June 2010

متن کامل

Single Machine Scheduling with Resource Dependent

Abstract We consider the single machine scheduling problem with resource dependent release times and processing times, in which both the release times and processing times are strictly linear decreasing functions of the amount of resources consumed. The objective is to minimize the makespan plus the total resource consumption costs. We propose a heuristic algorithm for the general problem by ut...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Scheduling

سال: 2016

ISSN: 1094-6136,1099-1425

DOI: 10.1007/s10951-016-0497-6